Minimum Distance Bounds for S-regular Codes Dedicated to Jaap Seidel on the Occasion of His 80th Birthday
نویسنده
چکیده
A code C F n is s-regular provided, for every vertex x 2 F n , if x is at distance at most s from C then the number of codewords y 2 C at distance i from x depends only on i and the distance from x to C. If denotes the covering radius of C and C is-regular, then C is said to be completely regular. Suppose C is a code with minimum distance d, strength t as an orthogonal array, and dual degree s. We prove that d 2t + 1 when C is completely regular (with the exception of binary repetition codes). The same bound holds when C is (t + 1)-regular. For unrestricted codes, we show that d s + t unless C is a binary repetition code. H(n; q) has vertex set X = F n and distance given by the Hamming metric dist(x; y) = jfh : x h 6 = y h gj : Let A denote the adjacency matrix of this graph and E j the matrix representing orthogonal projection onto the eigenspace V j belonging to eigenvalue j = n(q ? 1) ? qj (0 j n). Cf. 1, Theorem 9.2.1]. To any code C X (jCj > 1), we associate its outer distribution matrix D with rows indexed by X and columns indexed by f0; : : : ; ng and with (x; i) entry given by D xi = jfy 2 C : dist(x; y) = igj;
منابع مشابه
Coincidence Rotations of the Root Lattice a 4 Dedicated to Ludwig Danzer on the Occasion of His 80th Birthday
The coincidence site lattices of the root lattice A4 are considered, and the statistics of the corresponding coincidence rotations according to their indices is expressed in terms of a Dirichlet series generating function. This is possible via an embedding of A4 into the icosian ring with its rich arithmetic structure, which recently [6] led to the classification of the similar sublattices of A...
متن کاملHenson Graphs and Urysohn-henson Graphs as Cayley Graphs Dedicated to Professor Anatoly Vershik on the Occasion of His 80th Birthday
We discuss groups acting regularly on the Henson graphs Γn, answering a question posed by Peter Cameron, and we explore a number of related questions.
متن کاملSemidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
In this paper we apply the semidefinite programming approach developed in [2] to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in particular get a new tight bound in dimension 8. Furthermore we show how to use the SDP framework to get analytic bounds. Dedicated to Eiichi Bannai in occasion of his ...
متن کاملOn Mordell-weil Groups of Elliptic Curves Induced by Diophantine Triples
We study the possible structure of the groups of rational points on elliptic curves of the form y2 = (ax + 1)(bx + 1)(cx + 1), where a, b, c are non-zero rationals such that the product of any two of them is one less than a square. Dedicated to Professor Sibe Marde2i¢ on the occasion of his 80th birthday.
متن کاملSymmetry of Extremals of Functional Inequalities via Spectral Estimates for Linear Operators
We prove new symmetry results for the extremals of the Caffarelli-Kohn-Nirenberg inequalities in any dimension larger or equal than 2 , in a range of parameters for which no explicit results of symmetry were previously known. Dedicated to Elliott Lieb on the occasion of his 80th birthday
متن کامل